A Geometric Description of the Iterative Least-Squares Decod- ing of Analog Block Codes
نویسندگان
چکیده
This paper outlines that when decoding an arbitrary analog block codes, i.e., a block codes over the complex or real numbers, in an iterative fashion by splitting the H-Matrix in two, leads to a least-squares estimate. Such a Turbo-like algorithm represents iterative projections in Euclidean space. A step size controls the convergence speed. The paper generalized an earlier result based on array codes (product codes) with analog parity-check component codes. The results in here are considered to be an important step towards an intuitive understanding of iterative decoding schemes of conventional Turbo and LDPC codes.
منابع مشابه
Improving adaptive resolution of analog to digital converters using least squares mean method
This paper presents an adaptive digital resolution improvement method for extrapolating and recursive analog-to-digital converters (ADCs). The presented adaptively enhanced ADC (AE-ADC) digitally estimates the digital equivalent of the input signal by utilizing an adaptive digital filter (ADF). The least mean squares (LMS) algorithm also determines the coefficients of the ADF block. In this sch...
متن کاملIterative Least-Squares Decoding of Analog Product Codes
We define analog product codes as a special case of analog parallel concatenated codes. These codes serve as a tool to get some more insight into the convergence of “Turbo” decoding. We prove that the iterative “Turbo”-like decoding of analog product codes indeed is an estimation in the least-squares sense and thus correspond to the optimum maximum-likelihood decoding.
متن کاملGlobal least squares solution of matrix equation $sum_{j=1}^s A_jX_jB_j = E$
In this paper, an iterative method is proposed for solving matrix equation $sum_{j=1}^s A_jX_jB_j = E$. This method is based on the global least squares (GL-LSQR) method for solving the linear system of equations with the multiple right hand sides. For applying the GL-LSQR algorithm to solve the above matrix equation, a new linear operator, its adjoint and a new inner product are dened. It is p...
متن کاملTheory of block-pulse functions in numerical solution of Fredholm integral equations of the second kind
Recently, the block-pulse functions (BPFs) are used in solving electromagnetic scattering problem, which are modeled as linear Fredholm integral equations (FIEs) of the second kind. But the theoretical aspect of this method has not fully investigated yet. In this article, in addition to presenting a new approach for solving FIE of the second kind, the theory of both methods is investigated as a...
متن کاملSuperlinearly convergent exact penalty projected structured Hessian updating schemes for constrained nonlinear least squares: asymptotic analysis
We present a structured algorithm for solving constrained nonlinear least squares problems, and establish its local two-step Q-superlinear convergence. The approach is based on an adaptive structured scheme due to Mahdavi-Amiri and Bartels of the exact penalty method of Coleman and Conn for nonlinearly constrained optimization problems. The structured adaptation also makes use of the ideas of N...
متن کامل